The ω-Regular Post Embedding Problem
نویسنده
چکیده
Post’s Embedding Problem is a new variant of Post’s Correspondence Problem where words are compared with embedding rather than equality. It has been shown recently that adding regular constraints on the form of admissible solutions makes the problem highly non-trivial, and relevant to the study of lossy channel systems. Here we consider the infinitary version and its application to recurrent reachability in lossy channel systems.
منابع مشابه
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language
It was noticed by Harel in [Har86] that “one can define Σ 1 -complete versions of the well-known Post Correspondence Problem”. We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a regular ω-language is Σ 1 -complete, hence located beyond the arithmetical hierarchy and highly undecidable. We infer from this result that it is Π 1 -complete to d...
متن کاملPumping and Counting on the Regular Post Embedding Problem
The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular constraints on admissible solutions. It is known that this problem is decidable, albeit with very high complexity. We consider and solve variant problems where the set of solutions is compared to regular constraint sets and where on...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملComputing Blocker Sets for the Regular Post Embedding Problem
Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these languages and related decision problems.
متن کاملUndecidability in ω-Regular Languages
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word α such that h(α) = g(α). In the general case this problem was shown to be undecidable by K. Ruohonen (1985). Recently, it was proved that the infinite PCP is undecidable already when the domain alphabet of the morphisms co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008